// tspcluster - Traveling Salesman Problem
// Copyright (C) 2006  Frederik Carlier
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA

namespace UGent.Tsp
{
    /// <summary>
    /// Specifies which algorithm should be used by the Markov Chain.
    /// </summary>
    public enum AlgorithmType
    {
        /// <summary>
        /// Sampling will be done using the Metropolis algorithm, for the temperature
        /// defined by <see cref="MarkovChain.Beta"/>.
        /// </summary>
        Metropolis,

        /// <summary>
        /// Sampling will be done using the Metropolis-Hastings algorithm, for the
        /// probability distribution defined by <see cref="MarkovChain.Distribution"/>.
        /// </summary>
        MetropolisHastings,
        
        /// <summary>
        /// Sampling will be done using the Transition Matrix flat histogram method.
        /// </summary>
        Transitions,
        
        WangLandau
    }
}